Monadic refinements for relational cost analysis

Monadic Sequence Testing and Explicit Test-Refinements

We present an abstract framework for sequence testing that is implemented in Isabelle/HOL-TestGen. Our framework is based on the theory of state-exception monads, explicitly modelled in HOL, and can cope with typed input and output, interleaving executions including abort, and synchronisation. The framework is particularly geared towards symbolic execution and has proven effective in several la...

Fuzzy Relational Matrix-Based Stability Analysis for First-Order Fuzzy Relational Dynamic Systems

In this paper, two sets of sufficient conditions are obtained to ensure the existence and stability of a unique equilibrium point of unforced first-order fuzzy relational dynamical systems by using two different approaches which are both based on the fuzzy relational matrix of the model.In the first approach, the equilibrium point of the system is one of the centers of the related membership fu...

Weak Cost Monadic Logic over Infinite Trees

Cost monadic logic has been introduced recently as a quantitative extension to monadic second-order logic. A sentence in the logic defines a function from a set of structures to N∪{∞}, modulo an equivalence relation which ignores exact values but preserves boundedness properties. The rich theory associated with these functions has already been studied over finite words and trees. We extend the ...

Pharmaceutical cost containment with reference-based pricing: time for refinements.

Automated traceability analysis for UML model refinements

During iterative, UML-based software development, various UML diagrams, modeling the same system at different levels of abstraction are developed. These models must remain consistent when changes are performed. In this context, we refine the notion of impact analysis and distinguish horizontal impact analysis–that focuses on changes and impacts at one level of abstraction–from vertical impact a...